Copying in Natural Languages, Context-Freeness, and Queue Grammars

نویسنده

  • Alexis Manaster-Ramer
چکیده

The documentation of (unbounded-len~h) copying and cross-serial constructions in a few languages in the recent literature is usually taken to mean that natural languages are slightly context-sensitive. However, this ignores those copying constructions which, while productive, cannot be easily shown to apply to infinite sublanguages. To allow such finite copying constructions to be taken into account in formal modeling, it is necessary to recognize that natural languages cannot be realistically represented by formal languages of the usual sort. Rather, they must be modeled as families of formal languages or as formal languages with indefinite vocabularies. Once this is done, we see copying as a truly pervasive and fundamental process in human language. Furthermore, the absence of mirror-image constructions in human languages means that it is not enough to extend Context-free Grammars in the direction of context-sensitivity. Instead, a class of grammars must be found which handles (context-sensitive) copying but not (context-free) mirror images. This suggests that human linguistic processes use queues rather than stacks, making imperative the development of a hierarchy of Queue Grammars as a counterweight to the Chomsky Grammars. A simple class of Context-free Queue Grammars is introduced and discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata

A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class the DI-grammars cover unbound dependencies in a rather natural way. The place of DI-languages in the Chomsky-hierarchy will be determined: Like Aho's indexed Languages, DI-languages represent a proper subclass of Type 1 (contextsensitive languages) and p...

متن کامل

Contextual Grammars as Generative Models of Natural Languages

The paper discusses some classes of contextual grammars--mainly those with "maximal use of selectors"--giving some arguments that these grammars can be considered a good model for natural language syntax. A contextual grammar produces a language starting from a finite set of words and iteratively adding contexts to the currently generated words, according to a selection procedure: each context ...

متن کامل

Criteria to Disprove Context-Freeness of Collage Languages

Collage grammars generate picture languages in a context-free way. The generating process is based on the replacement of atomic nonterminal items and can be seen as an adaptation of the notion of hyperedge replacement known from the area of context-free graph generation. While a pumping lemma holds for hyperedge replacement graph grammars and is quite useful to show that certain graph languages...

متن کامل

List automata with syntactically structured output

A new type of abstract automaton is introduced, and both formal and linguistic implications are discussed, most importantly a new possibility of proving certain formal properties of (natural) languages and their grammars (such as context-freeness) and of refinement of the Chomsky hierarchy.

متن کامل

Beyond Semilinearity: Distributional Learning of Parallel Multiple Context-free Grammars

Semilinearity is widely held to be a linguistic invariant but, controversially, some linguistic phenomena in languages like Old Georgian and Yoruba seem to violate this constraint. In this paper we extend distributional learning to the class of parallel multiple context-free grammars, a class which as far as is known includes all attested natural languages, even taking an extreme view on these ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1986